منابع مشابه
Pebble Weighted Automata and Transitive Closure Logics
We introduce new classes of weighted automata on words. Equipped with pebbles and a two-way mechanism, they go beyond the class of recognizable formal power series, but capture a weighted version of first-order logic with bounded transitive closure. In contrast to previous work, this logic allows for unrestricted use of universal quantification. Our main result states that pebble weighted autom...
متن کاملTransitive Closure of Innnite Graphs and Its Applications Transitive Closure of Innnite Graphs and Its Applications
Integer tuple relations can concisely summarize many types of information gathered from analysis of scientiic codes. For example they can be used to precisely describe which iterations of a statement are data dependent of which other iterations. It is generally not possible to represent these tuple relations by enumerating the related pairs of tuples. For example, it is impossible to enumerate ...
متن کاملNested Pebbles and Transitive Closure
First-order logic with k-ary deterministic transitive closure has the same power as two-way k-head deterministic automata that use a finite set of nested pebbles. This result is valid for strings, ranked trees, and in general for families of graphs having a fixed automaton that can be used to traverse the nodes of each of the graphs in the family. Other examples of such families are grids, toru...
متن کاملHybrid Transitive Closure Algorithms
We present a new family of hybrid transitive closure algorithms, and present experimental results showing that these algorithms perform better than existing transitive closure algorithms, includmg matrix-based algorithms that divide a matrix into stripes or into square blocks, and graph-based algmtihms. This family of algorithms can be generalized to solve path problems and to solve problems in...
متن کاملTransitive-closure spanners
We define the notion of a transitive-closure spanner of a directed graph. Given a directed graph G = (V,E) and an integer k ≥ 1, a k-transitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V,EH) that has (1) the same transitive-closure as G and (2) diameter at most k. These spanners were studied implicitly in access control, property testing, and data structures, and properties ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1968
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(68)91096-6